An improved Jaya algorithm with a modified swap operator for solving team formation problem
نویسندگان
چکیده
منابع مشابه
An improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملAn Improved DPSO Algorithm for Cell Formation Problem
Cellular manufacturing system, an application of group technology, has been considered as an effective method to obtain productivity in a factory. For design of manufacturing cells, several mathematical models and various algorithms have been proposed in literature. In the present research, we propose an improved version of discrete particle swarm optimization (PSO) to solve manufacturing cell ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA modified VIM for solving an inverse heat conduction problem
In this paper, we will use a modified variational iteration method (MVIM) for solving an inverse heat conduction problem (IHCP). The approximation of the temperature and the heat flux at are considered. This method is based on the use of Lagrange multipliers for the identification of optimal values of parameters in a functional in Euclidian space. Applying this technique, a rapid convergent s...
متن کاملa genetic algorithm with modified crossover operator for a two-agent scheduling problem
the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2020
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-020-04965-x